<div class="problemindexholder" problemindex="B">
 <div class="ttypography">
  <div class="problem-statement">
   <div class="header">
    <div class="title">
     B. 3-palindrome
    </div>
    <div class="time-limit">
     <div class="property-title">
      time limit per test
     </div>
     1 second
    </div>
    <div class="memory-limit">
     <div class="property-title">
      memory limit per test
     </div>
     256 megabytes
    </div>
    <div class="input-file">
     <div class="property-title">
      input
     </div>
     standard input
    </div>
    <div class="output-file">
     <div class="property-title">
      output
     </div>
     standard output
    </div>
   </div>
   <div>
    <p>
     In the beginning of the new year Keivan decided to reverse his name. He doesn't like palindromes, so he changed Naviek to Navick.
    </p>
    <p>
     He is too selfish, so for a given
     <span class="tex-span">
      <i>
       n
      </i>
     </span>
     he wants to obtain a string of
     <span class="tex-span">
      <i>
       n
      </i>
     </span>
     characters, each of which is either '
     <span class="tex-font-style-tt">
      a
     </span>
     ', '
     <span class="tex-font-style-tt">
      b
     </span>
     ' or '
     <span class="tex-font-style-tt">
      c
     </span>
     ', with no
     <span class="tex-font-style-it">
      palindromes
     </span>
     of length
     <span class="tex-span">
      3
     </span>
     appearing in the string as a substring. For example, the strings "
     <span class="tex-font-style-tt">
      abc
     </span>
     " and "
     <span class="tex-font-style-tt">
      abca
     </span>
     " suit him, while the string "
     <span class="tex-font-style-tt">
      aba
     </span>
     " doesn't. He also want the number of letters '
     <span class="tex-font-style-tt">
      c
     </span>
     ' in his string to be as little as possible.
    </p>
   </div>
   <div class="input-specification">
    <div class="section-title">
     Input
    </div>
    <p>
     The first line contains single integer
     <span class="tex-span">
      <i>
       n
      </i>
     </span>
     (
     <span class="tex-span">
      1 ≤
      <i>
       n
      </i>
      ≤ 2·10
      <sup class="upper-index">
       5
      </sup>
     </span>
     ) — the length of the string.
    </p>
   </div>
   <div class="output-specification">
    <div class="section-title">
     Output
    </div>
    <p>
     Print the string that satisfies all the constraints.
    </p>
    <p>
     If there are multiple answers, print any of them.
    </p>
   </div>
   <div class="sample-tests">
    <div class="section-title">
     Examples
    </div>
    <div class="sample-test">
     <div class="input">
      <div class="title">
       Input
      </div>
      <pre>2<br/></pre>
     </div>
     <div class="output">
      <div class="title">
       Output
      </div>
      <pre>aa<br/></pre>
     </div>
     <div class="input">
      <div class="title">
       Input
      </div>
      <pre>3<br/></pre>
     </div>
     <div class="output">
      <div class="title">
       Output
      </div>
      <pre>bba<br/></pre>
     </div>
    </div>
   </div>
   <div class="note">
    <div class="section-title">
     Note
    </div>
    <p>
     A
     <span class="tex-font-style-it">
      palindrome
     </span>
     is a sequence of characters which reads the same backward and forward.
    </p>
   </div>
  </div>
  <p>
  </p>
 </div>
</div>
